Computational Appendix: Hamilton Decompositions of 6-regular Cayley Graphs on Even Abelian Groups with Involution-free Connection Sets
نویسنده
چکیده
Z2 ⊕ Z12 {(1, 4), (1, 5), (0, 3)}, {(1, 3), (1, 4), (0, 3)}, {(0, 1), (0, 2), (1, 1)}, {(1, 3), (0, 4), (1, 2)}, {(1, 3), (1, 5), (0, 3)}, {(0, 4), (0, 5), (1, 2)}, {(0, 2), (1, 5), (1, 2)}, {(1, 3), (0, 1), (1, 5)}, {(0, 1), (0, 3), (1, 2)}, {(1, 3), (0, 1), (0, 4)}, {(0, 2), (0, 3), (1, 2)}, {(1, 4), (1, 1), (1, 2)}, {(1, 4), (1, 5), (0, 5)}, {(1, 3), (0, 1), (0, 5)}, {(0, 2), (0, 3), (1, 1)}, {(0, 1), (0, 4), (1, 1)}, {(0, 1), (1, 4), (0, 5)}, {(1, 3), (0, 3), (0, 4)} Z2 ⊕ Z2 ⊕ Z6 {(0, 0, 1), (1, 1, 1), (1, 0, 1)}
منابع مشابه
Hamilton decompositions of 6-regular Cayley graphs on even Abelian groups with involution-free connections sets
Alspach conjectured that every connected Cayley graph on a finite Abelian group A is Hamiltondecomposable. Liu has shown that for |A| even, if S = {s1, . . . , sk} ⊂ A is an inverse-free strongly minimal generating set of A, then the Cayley graph Cay(A;S?), is decomposable into k Hamilton cycles, where S? denotes the inverse-closure of S. Extending these techniques and restricting to the 6-regu...
متن کاملHamilton decompositions of certain 6-regular Cayley graphs on Abelian groups with a cyclic subgroup of index two
Alspach conjectured that every connected Cayley graph on a finite Abelian group A is Hamiltondecomposable. Liu has shown that for |A| even, if S = {s1, . . . , sk} ⊂ A is an inverse-free strongly minimal generating set of A, then the Cayley graph Cay(A;S?), is decomposable into k Hamilton cycles, where S? denotes the inverse-closure of S. Extending these techniques and restricting to the 6-regu...
متن کاملNORMAL 6-VALENT CAYLEY GRAPHS OF ABELIAN GROUPS
Abstract : We call a Cayley graph Γ = Cay (G, S) normal for G, if the right regular representation R(G) of G is normal in the full automorphism group of Aut(Γ). In this paper, a classification of all non-normal Cayley graphs of finite abelian group with valency 6 was presented.
متن کاملOn the Finite Groups that all Their Semi-Cayley Graphs are Quasi-Abelian
In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014